Generating Automatic Projections by Means of Genetic Programming

نویسندگان

  • C. ESTÉBANEZ
  • Enrique Alba
  • Christian Blum
  • Pedro Isasi
  • Coromoto León
چکیده

The aim of inductive machine learning (ML) is to generate models that can make predictions from analysis of data sets. These data sets consist of a number of instances or examples, each example described by a set of attributes. It is known that the quality or relevance of the attributes of a data set is a key issue when trying to obtain models with a satisfactory level of generalization. There are many techniques of feature extraction, construction, and selection [1] that try to improve the representation of data sets, thus increasing the prediction capabilities of traditional ML algorithms. These techniques work by filtering nonrelevant attributes or by recombining the original attributes into higher-quality ones. Some of these techniques were created in an automatic way by means of genetic programming (GP). GP is an evolutionary technique for evolving symbolic programs [2]. Most research has focused on evolving functional expressions, but the use of loops and recursion has also been considered [3]. Evolving circuits are also among the successes of GP [4]. In this work we present a method for attribute generation based on GP called the GPPE (genetic programming projection engine). Our aim is to evolve symbolic mathematical expressions that are able to transform data sets by representing data on a new space, with a new set of attributes created by GP. The goal of the transformation is to be able to obtain higher accuracy in the target space than in the original space. The dimensions of the new data space can be equal to, larger, or smaller than those of the original. Thus, we also intend that GPPE be used as a dimension reduction technique as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)

This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...

متن کامل

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

A Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm

In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...

متن کامل

DISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009